Molecular computing: paths to chemical Turing machines
نویسندگان
چکیده
To comply with the rapidly increasing demand of information storage and processing, new strategies for computing are needed. The idea of molecular computing, where basic computations occur through molecular, supramolecular, or biomolecular approaches, rather than electronically, has long captivated researchers. The prospects of using molecules and (bio)macromolecules for computing is not without precedent. Nature is replete with examples where the handling and storing of data occurs with high efficiencies, low energy costs, and high-density information encoding. The design and assembly of computers that function according to the universal approaches of computing, such as those in a Turing machine, might be realized in a chemical way in the future; this is both fascinating and extremely challenging. In this perspective, we highlight molecular and (bio)macromolecular systems that have been designed and synthesized so far with the objective of using them for computing purposes. We also present a blueprint of a molecular Turing machine, which is based on a catalytic device that glides along a polymer tape and, while moving, prints binary information on this tape in the form of oxygen atoms.
منابع مشابه
Some improvements in fuzzy turing machines
In this paper, we improve some previous definitions of fuzzy-type Turing machines to obtain degrees of accepting and rejecting in a computational manner. We apply a BFS-based search method and some level’s upper bounds to propose a computational process in calculating degrees of accepting and rejecting. Next, we introduce the class of Extended Fuzzy Turing Machines equipped with indeterminacy s...
متن کاملEfficient Turing-Universal Computation with DNA Polymers
Bennett’s proposed chemical Turing machine is one of the most important thought experiments in the study of the thermodynamics of computation. Yet the sophistication of molecular engineering required to physically construct Bennett’s hypothetical polymer substrate and enzyme has deterred experimental implementations. Here we propose a chemical implementation of stack machines — a Turing-univers...
متن کاملMolecular Computing Machines
Biopolymers such as nucleic acids and proteins encode biological data and may be viewed as strings of chemical letters. While electronic computers manipulate strings of 0’s and 1’s encoded in electric signals, biologically encoded data might, in principle, be manipulated by biochemical means. During the last decade, several approaches to compute with biomolecules were developed, and the field h...
متن کاملThreshold Computation and Cryptographic Security
Threshold machines are Turing machines whose acceptance is determined by what portion of the machine's computation paths are accepting paths. Probabilistic machines are Turing machines whose acceptance is determined by the probability weight of the machine's accepting computation paths. In 1975, Simon proved that for unbounded-error polynomial-time machines these two notions yield the same clas...
متن کاملPreface / Editorial
The conference series Machines, Computations and Universality (MCU) explores computation in the setting of various discrete models, such as Turing machines, register machines, cellular automata, tile assembly systems, rewriting systems, molecular computing models and neural models, and in the setting of analog and hybrid models, including BSS machines, signal machines and quantum computing, to ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره 6 شماره
صفحات -
تاریخ انتشار 2015